Fractional chromatic number of a random subgraph
نویسندگان
چکیده
منابع مشابه
Dichromatic Number and Fractional Chromatic Number
The dichromatic number of a graph G is the maximum integer k such that there exists an orientation of the edges of G such that for every partition of the vertices into fewer than k parts, at least one of the parts must contain a directed cycle under this orientation. In 1979, Erdős and NeumannLara conjectured that if the dichromatic number of a graph is bounded, so is its chromatic number. We m...
متن کاملThe fractional chromatic number of mycielski's graphs
The most familiar construction of graphs whose clique number is much smaller than their chromatic number is due to Mycielski, who constructed a sequence G n of triangle-free graphs with (G n ) = n. In this note, we calculate the fractional chromatic number of G n and show that this sequence of numbers satis es the unexpected recurrence a n+1 = a n + 1 a n .
متن کاملThe fractional chromatic number of the plane
The chromatic number of the plane is the chromatic number of the uncountably infinite graph that has as its vertices the points of the plane and has an edge between two points if their distance is 1. This chromatic number is denoted χ(R). The problem was introduced in 1950, and shortly thereafter it was proved that 4 ≤ χ(R) ≤ 7. These bounds are both easy to prove, but after more than 60 years ...
متن کاملForbidden Subgraph Colorings and the Oriented Chromatic Number
We present an improved upper bound of O(d 1 m−1 ) for the (2,F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of edges in any member of F . This bound is tight up to a (log d) multiplicative factor and improves the previous bound presented in [1]. We also obtain a relationship connecting the oriented chromatic number χo(G) of graphs an...
متن کاملThe Chromatic Number of Random Regular Graphs
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1, or k + 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2020
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22571